Face Recognition using Approximate String Matching
نویسنده
چکیده
String matching algorithm is a very useful algorithm in pattern matching that can be used to match any patterns that can be represented in strings or sequence. This paper will discussed how string matching can be used as a method for face recognition. We will focus on the implementation using approximate string matching. In order for face images to be implemented in pattern matching, they have to be represented in representation supported for the usage of string matching. We use one type of representation which is to represent data of facial features in a sequence of strings with each strings being measurable facial feature data.
منابع مشابه
Recognizing Partially Occluded Faces from a Single Sample Per Class Using String-Based Matching
Automatically recognizing human faces with partial occlusions is one of the most challenging problems in face analysis community. This paper presents a novel string-based face recognition approach to address the partial occlusion problem in face recognition. In this approach, a new face representation, Stringface, is constructed to integrate the relational organization of intermediate-level fea...
متن کاملCross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new formalism for a class of applications that takes two strings as input, each specified in terms of a particular domain, and performs a comparison motivated by constraints derived from a third, possibly different domain. ...
متن کاملShape recognition using fuzzy string-matching technique
Object recognition is a very important task in industrial applications. Attributed string matching is a well-known technique for pattern matching. The present paper proposes a fuzzy string-matching approach for two-dimensional object recognition. The fuzzy numbers are used to represent the edit costs. Therefore, the edit distances are also presented as fuzzy numbers. The attributed string-match...
متن کاملCharacter Recognition using Discrete Curve with the use of Approximate String Matching
This paper deals with the recognition of printed basic Telugu characters using the discrete curves and approximation string matching. The features are extracted from smoothed images, obtained after the thinning operation. As by only thinning, spines may arise which will affect the recognition of the character. The features are the discrete curves, specified using the 3×3 regions of connected co...
متن کامل